A generalization of descent polynomials
نویسندگان
چکیده
The notion of a descent polynomial, function in enumerative combinatorics that counts permutations with specific properties, enjoys revived recent research interest due to its connection other important notions combinatorics, viz. peak polynomials and symmetric functions. We define the dm(I,n) as generalization polynomial we prove for any positive integer m, this is n sufficiently large (similarly polynomial). obtain an explicit formula when m large. look at coefficients different falling factorial bases. positivity discover combinatorial interpretation them. This result similar Diaz-Lopez et al. polynomial.
منابع مشابه
a generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
Some compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملA Generalization of the Kostka-foulkes Polynomials
Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and twocolumn Macdonald-Kostka polynomials occur as special cases. Conjecturally these polynomials coincide with the Poincaré polynomials of isotypic components of certain graded GL(n)-modules supported in a nilpotent conjugacy class closure i...
متن کاملGeneric Polynomials are Descent-Generic
Let g(X) ∈ K(t1, . . . , tm)[X] be a generic polynomial for a group G in the sense that every Galois extension N/L of infinite fields with group G and K ≤ L is given by a specialization of g(X). We prove that then also every Galois extension whose group is a subgroup of G is given in this way. Let K be a field and G a finite group. Let us call a monic, separable polynomial g(t1, . . . , tm, X) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113105